On a conjecture of Manickam and Singhi
نویسنده
چکیده
Let In = {1; 2; : : : ; n} and x : In → R be a map such that ∑i∈In xi ¿ 0. (For any i, its image is denoted by xi.) Let F = {J ⊂ In : |J | = k, and ∑j∈J xj ¿ 0}. Manickam and Singhi (J. Combin. Theory Ser. A 48 (1) (1988) 91–103) have conjectured that |F|¿ ( n−1 k−1 ) whenever n¿ 4k and showed that the conclusion of the conjecture holds when k divides n. For any two integers r and ‘ let [r]‘ denote the smallest positive integer congruent to r (mod ‘). Bier and Manickam (Southeast Asian Bull. Math. 11 (1) (1987) 61–67) have shown that if k ¿ 3 and n¿ k(k− 1)k(k− 2) + k(k− 1)2(k− 2)+ k[n]k then the conjecture holds. In this note, we give a short proof to show that the conjecture holds when n¿ 2ek. c © 2003 Elsevier B.V. All rights reserved.
منابع مشابه
New results related to a conjecture of Manickam and Singhi
In 1998 Manickam and Singhi conjectured that for every positive integer d and every n ≥ 4d, every set of n real numbers whose sum is nonnegative contains at least ( n−1 d−1 ) subsets of size d whose sums are nonnegative. In this paper we establish new results related to this conjecture. We also prove that the conjecture of Manickam and Singhi does not hold for n = 2d + 2.
متن کاملA Class of lattices and boolean functions related to a Manickam-Mikl\"os-Singhi Conjecture
The aim of this paper is to build a new family of lattices related to some combinatorial extremal sum problems, in particular to a conjecture of Manickam, Miklös and Singhi. We study the fundamentals properties of such lattices and of a particular class of boolean functions defined on them.
متن کاملA linear bound on the Manickam-Miklós-Singhi conjecture
Suppose that we have a set of numbers x1, . . . , xn which have nonnegative sum. How many subsets of k numbers from {x1, . . . , xn} must have nonnegative sum? Manickam, Miklós, and Singhi conjectured that for n ≥ 4k the answer is ( n−1 k−1 ) . This conjecture is known to hold when n is large compared to k. The best known bounds are due to Alon, Huang, and Sudakov who proved the conjecture when...
متن کاملA Branch-and-Cut Strategy for the Manickam-Miklos-Singhi Conjecture
The Manickam-Miklós-Singhi Conjecture states that when n ≥ 4k, every multiset of n real numbers with nonnegative total sum has at least ( n−1 k−1 ) k-subsets with nonnegative sum. We develop a branch-and-cut strategy using a linear programming formulation to show that verifying the conjecture for fixed values of k is a finite problem. To improve our search, we develop a zero-error randomized pr...
متن کاملThe Minimum Number of Nonnegative Edges in Hypergraphs
An r-unform n-vertex hypergraph H is said to have the Manickam-Miklós-Singhi (MMS) property if for every assignment of weights to its vertices with nonnegative sum, the number of edges whose total weight is nonnegative is at least the minimum degree of H. In this paper we show that for n > 10r, every r-uniform n-vertex hypergraph with equal codegrees has the MMS property, and the bound on n is ...
متن کاملA linear programming approach to the Manickam-Miklós-Singhi conjecture
Iowa State University does not discriminate on the basis of race, color, age, religion, national origin, sexual orientation, gender identity, sex, marital status, disability, or status as a U.S. veteran. Inquiries can be directed to the Director of Equal Opportunity and Diversity, 3210 Beardshear Hall, (515) 294-7612. IOWA STATE UNIVERSITY A linear programming approach to the ManickamMiklos-Sin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 272 شماره
صفحات -
تاریخ انتشار 2003